Research Article Delay Analysis of an M/G/1/K Priority Queueing System with Push-out Scheme
نویسندگان
چکیده
This paper considers an M/G/1/K queueing system with push-out scheme which is one of the loss priority controls at a multiplexer in communication networks. The loss probability for the model with push-out scheme has been analyzed, but the waiting times are not available for the model. Using a set of recursive equations, this paper derives the LaplaceStieltjes transforms (LSTs) of the waiting time and the push-out time of low-priority messages. These results are then utilized to derive the loss probability of each traffic type and the mean waiting time of high-priority messages. Finally, some numerical examples are provided.
منابع مشابه
Emergency Location Problems with an M/G/k Queueing System
Since late 1960's, the emergency location problems, fire stations and medical emergency services have attracted the attention of researchers. Mathematical models, both deterministic and probabilistic, have been proposed and applied to find suitable locations for such facilities in many urban and rural areas. Here, we review some models proposed for finding the location of such facilities, wit...
متن کاملAnalysis of a Finite Buffer Queue with Different Scheduling and Push-Out Schemes
A queueing system M1, M 2 / G 1, G 2 / 1 / N with different scheduling and push-out scheme is analyzed in this paper. This work is motivated by the study of the performance of an output link of ATM switches with traffic of two classes with different priorities. However, the queueing model developed in this paper is more general than that of the output link of ATM switches with two-class priorit...
متن کاملM1, M2, ..., Mk/G1, G2,..., Gk/l/N Queue with Buffer Division and Push-Out Schemes for ATM Networks (RESEARCH NOTE)
In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...
متن کاملApproximation Method for Performance Analysis of Queueing System with Multimedia Traffics
We consider a single server queueing system with two types of traffic where traffic of type 1 (such as data) are delay-insensitive and loss-sensitive and traffic of type 2 (such as voice) are delay-sensitive and loss-insensitive. To provide the required Quality of Service (QoS) of each type of traffic, we adopt the strict priority scheme for delay and push-out scheme with threshold for loss. Th...
متن کاملA Delay and Loss Versatile Scheduling Discipline in ATM Switches
In this paper, we propose a versatile scheduling discipline, called Precedence with Partial Push–out (PPP), in Asynchronous Transfer Mode (ATM) switches supporting two delay and two loss priorities. By employing a threshold L, PPP provides delay guarantee by allowing a newly–arriving highdelay–priority cell to precede a maximum of L low-delay– priority cells. Through the use of another threshol...
متن کامل